On the Relationship between Abductive Reasoning and Boolean Minimization
نویسندگان
چکیده
Abductive reasoning involves determining a parsimonious set of explanations that can account for a set of observations. In the Boolean minimization problem, the designer attempts to express a Boolean formula as a sum of products or product of sums expression of the smallest size that satisfies the desired function. In this paper, we show that independent abduction problem can be encoded as an instance of Boolean minimization problem, and conversely, a Boolean minimization problem as an abduction problem. We then consider the application of the transitivity results from the parsimonious covering theory to the Boolean minimization. We conclude with a brief comparison to the related work.
منابع مشابه
On the Relationship between Parsimonious Covering and Boolean Minimization
Minimization of Boolean switching functions is a basic problem in the design of logic circuits. The designer first comes up with a switching funct.ion expressed in terms of several binary input. variables that satisfies tlie desired functionality, and then attempts t.0 minimize the function as a sum of products or product of sums. It turns out that a sum of products form of a switching function...
متن کاملNatural properties of abductive hypotheses in three-valued logic
This paper shows some interesting properties of Kleene’s threevalued logic in relation to abductive reasoning. A semantical characterization of abductive explanations is proposed, based on the notion of minimal three-valued model. This establishes a relation between the minimization problem in abductive reasoning and three-valued semantics, in the same sense as non-monotonic reasoning deals wit...
متن کاملAbduction as Satisfiability
Abduction is reasoning in propositional or first-order logic that provides explanations for observations. We show how context-free parsing and automated planning can be formulated using abductive rules and present a fast prover based on propositional satisfiability. Furthermore we show how weighted abduction can be efficiently implemented in the prover.
متن کاملAbductive network action inference for targeted therapy discovery
Complex diseases such as cancer result from the combined actions of genetic perturbations whose characterization is crucial to determine the healing treatment. The challenge of therapy discovery focuses on the identification of the causal mechanisms underlying the genotype-phenotype relationships. In this undertaking, networks provide suitable representations to model molecular interactions and...
متن کاملAn Abductive Framework for Negation in Disjunctive Logic Programming
In this paper, we study an abductive framework for disjunctive logic programming that provides a new way to understand negation in disjunctive logic programming. We show that the deened framework captures the existing minimal model semantics based on (Extended) Generalised Closed World Assumption ((E)GCWA). This relationship between abduction and minimal model reasoning provides a methodology t...
متن کامل